Subgraph Coverings and Edge Switchings
نویسندگان
چکیده
منابع مشابه
On Perfect Matching Coverings and Even Subgraph Coverings
A perfect matching covering of a graph G is a set of perfect matchings of G such that every edge of G is contained in at least one member of it. Berge conjectured that every bridgeless cubic graph admits a perfect matching covering of order at most 5 (we call such a collection of perfect matchings a Berge covering of G). A cubic graph G is called a Kotzig graph if G has a 3-edge-coloring such t...
متن کاملk-edge Subgraph Problems
We study here a problem on graphs that involves finding a subgraph of maximum node weights spanning up to k edges. We interpret the concept of “spanning” to mean that at least one endpoint of the edge is in the subgraph in which we seek to maximize the total weight of the nodes. We discuss the complexity of this problem and other related problems with different concepts of “spanning” and show t...
متن کاملEigenvalues of 2-edge-coverings
A 2-edge-covering between G and H is an onto homomorphism from the vertices of G to the vertices of H so that each edge is covered twice and edges in H can be lifted back to edges in G. In this note we show how to compute the spectrum of G by computing the spectrum of two smaller graphs, namely a (modified) form of the covered graph H and another graph which we term the anti-cover. This is done...
متن کاملApproximating the Maximum 3- and 4-Edge-Colorable Subgraph
We study large k-edge-colorable subgraphs of simple graphs and multigraphs. We show that: – every simple subcubic graph G has a 3-edge-colorable subgraph (3ECS) with at least 13 15 |E(G)| edges, unless G is isomorphic to K4 with one edge subdivided, – every subcubic multigraph G has a 3-ECS with at least 7 9 |E(G)| edges, unless G is isomorphic to K3 with one edge doubled, – every simple graph ...
متن کاملThe node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
Let G = (V, E) be an undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the wellknown Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2002
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2063